Maximal Digraphs with Respect to Primitive Positive Constructability

نویسندگان

چکیده

We study the class of all finite directed graphs up to primitive positive constructability. The resulting order has a unique greatest element, namely graph $P_1$ with one vertex and no edges. lower bound, $P_2$ two vertices edge. Our main result is complete description bounds $P_2$; we call these submaximal. show that every not equivalent below submaximal graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs maximal with respect to hom-properties

For a simple graph H, → H denotes the class of all graphs that admit homomorphisms to H (such classes of graphs are called homproperties). We investigate hom-properties from the point of view of the lattice of hereditary properties. In particular, we are interested in characterization of maximal graphs belonging to → H. We also provide a description of graphs maximal with respect to reducible h...

متن کامل

Maximal graphs with respect to hereditary properties

A property of graphs is a non-empty set of graphs. A property P is called hereditary if every subgraph of any graph with property P also has property P. Let P1, . . . ,Pn be properties of graphs. We say that a graph G has property P1◦ · · · ◦Pn if the vertex set of G can be partitioned into n sets V1, . . . , Vn such that the subgraph of G induced by Vi has property Pi; i = 1, . . . , n. A here...

متن کامل

Well primitive digraphs

A primitive digraph D is said to be well primitive if the local exponents of D are all equal. In this paper we consider well primitive digraphs of two special types: digraphs that contain loops, and symmetric digraphs with shortest odd cycle of length r. We show that the upper bound of the exponent of the well primitive digraph is n− 1 in both these classes of digraphs, and we characterize the ...

متن کامل

Infinitely many maximal primitive positive clones in a diagonalizable algebra

We present a rather simple example of infinitely many maximal primitive positive clones in a diagonalizable algebra, which serve as an algebraic model for the provability propositional logic GL. Mathematics subject classification: 03F45, 03G25, 06E25.

متن کامل

a comparison of teachers and supervisors, with respect to teacher efficacy and reflection

supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2022

ISSN: ['0209-9683', '1439-6912']

DOI: https://doi.org/10.1007/s00493-022-4918-1